Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
نویسندگان
چکیده
In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which the problem is solvable. We show that the problem admits a polynomial-time algorithm for two unrelated classes of graphs: proper interval graphs and trivially-perfect graphs. To complement our result, we show that the problem remains NP-complete on split graphs, and consequently also on chordal graphs. Thus we contribute to define the first border between graph classes on which the problem is polynomially solvable and on which it remains NP-complete.
منابع مشابه
Parameterized Aspects of Strong Subgraph Closure
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F -closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F free Edge Deletion. In Strong F -closure, we want to select a maxi...
متن کاملOn the Relation of Strong Triadic Closure and Cluster Deletion
We study the parameterized and classical complexity of two related problems on undirected graphs G = (V,E). In Strong Triadic Closure we aim to label the edges in E as strong and weak such that at most k edges are weak and G contains no induced P3 with two strong edges. In Cluster Deletion, we aim to destroy all induced P3s by a minimum number of edge deletions. We first show that Strong Triadi...
متن کاملComponent Coloring of Proper Interval Graphs and Split Graphs
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of component coloring of graphs. Given a graph, the problem is to color the vertices using the minimum number of colors so that the size of each connected component of the subgraph induced by the vertices of the same color does not exceed C. We give a linear time algorithm for the problem ...
متن کاملCutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کامل